Solving Nonlinear Inverse Heat Conduction Problem Base on Growing Competitive Ant Algorithm
نویسندگان
چکیده
منابع مشابه
A novel computational procedure based on league championship algorithm for solving an inverse heat conduction problem
Inverse heat conduction problems, which are one of the most important groups of problems, are often ill-posed and complicated problems, and their optimization process has lots of local extrema. This paper provides a novel computational procedure based on finite differences method and league championship algorithm to solve a one-dimensional inverse heat conduction problem. At the beginning, we u...
متن کاملSolving an Inverse Heat Conduction Problem by Spline Method
In this paper, a numerical solution of an inverse non-dimensional heat conduction problem by spline method will be considered. The given heat conduction equation, the boundary condition, and the initial condition are presented in a dimensionless form. A set of temperature measurements at a single sensor location inside the heat conduction body is required. The result show that the proposed meth...
متن کاملA regularization method for solving a nonlinear backward inverse heat conduction problem using discrete mollification method
The present essay scrutinizes the application of discrete mollification as a filtering procedure to solve a nonlinear backward inverse heat conduction problem in one dimensional space. These problems are seriously ill-posed. So, we combine discrete mollification and space marching method to address the ill-posedness of the proposed problem. Moreover, a proof of stability and<b...
متن کاملA modified VIM for solving an inverse heat conduction problem
In this paper, we will use a modified variational iteration method (MVIM) for solving an inverse heat conduction problem (IHCP). The approximation of the temperature and the heat flux at are considered. This method is based on the use of Lagrange multipliers for the identification of optimal values of parameters in a functional in Euclidian space. Applying this technique, a rapid convergent s...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Energy Procedia
سال: 2011
ISSN: 1876-6102
DOI: 10.1016/j.egypro.2011.12.669